Dyck Words, Lattice Paths, and Abelian Borders
نویسندگان
چکیده
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on the exact number of binary words of a given length with no abelian borders. Furthermore, we generalize these results to partial words.
منابع مشابه
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving)
In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in Z not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number...
متن کاملCard Deals, Lattice Paths, Abelian Words and Combinatorial Identities
We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apéry numbers, ∑n k=0 (n k )(n+k k ) ∑k j=0 (k j 3 = ∑n k=0 (n k )2(n+k k 2 . The combinatorial constructs employed are derangement-type card deals as introduced in a previous paper on Barrucand’s identity, labeled lattice paths and, following a comme...
متن کامل1 9 N ov 2 00 4 Lattices of lattice paths ∗
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e., lattices of Dyck paths) and give a recursive construction for them. The last section is devoted to the presentation of a couple of open problems.
متن کاملGeneralizations of The Chung-Feller Theorem
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length n with flaws m is the n-th Catalan number and independent on m. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this paper, we find the connections between these two Chung-Feller theorems. We focus on the weighted versions of three classes of lattice paths and give the generalizati...
متن کاملCounting Generalized Dyck Paths
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from (0, 0) to (n, n) which is below the diagonal line y = x. One way to generalize the definition of Dyck path is to change the end point of Dyck path, i.e. we define (generalized) Dyck path to be a lattice path from (0, 0) to (m, n) ∈ N2 which is below the diagonal line y...
متن کامل